The S-metric, the Beichl-Cloteaux approximation, and preferential attachment
نویسنده
چکیده
Abstract. This paper presents an efficient algorithm to approximate the Smetric, which normalizes a graph’s assortativity by its maximum possible value. The algorithm is used to track in detail the assortative structure of growing preferential attachment trees, and to study the evolving structure and preferential attachment of several mathematics coauthorship graphs. These graphs’ behavior belies expectations; implications are discussed.
منابع مشابه
Generating Network Models Using the S-Metric
The ability to create random models of real networks is useful for understanding the interactions in these systems. Several researchers have proposed modeling complex networks by using the node degree distribution, the most popular being a power-law distribution. Recent work by Li et al. introduced the S metric as a metric to characterize the structure of networks with power-law distributions. ...
متن کاملOptimal coincidence best approximation solution in non-Archimedean Fuzzy Metric Spaces
In this paper, we introduce the concept of best proximal contraction theorems in non-Archimedean fuzzy metric space for two mappings and prove some proximal theorems. As a consequence, it provides the existence of an optimal approximate solution to some equations which contains no solution. The obtained results extend further the recently development proximal contractions in non-Archimedean fuz...
متن کاملGeometric preferential attachment in non-uniform metric spaces
We investigate the degree sequences of geometric preferential attachment graphs in general compact metric spaces. We show that, under certain conditions on the attractiveness function, the behaviour of the degree sequence is similar to that of the preferential attachment with multiplicative fitness models investigated by Borgs et al. When the metric space is finite, the degree distribution at e...
متن کاملBest Coapproximation in Quotient Spaces
As a counterpart to best approximation, a new kind of approximation, called best coapproximation was introduced in normed linear spaces by C. Franchetti and M. Furi. In this paper, we use this coapproximation to prove some results on the existence and uniqueness of best coapproximation in quotient spaces when the underlying spaces are metric linear spaces. We shall also see how coproximinality ...
متن کاملThe power of choice combined with preferential attachment ∗
We prove almost sure convergence of the maximum degree in an evolving tree model combining local choice and preferential attachment. At each step in the growth of the graph, a new vertex is introduced. A fixed, finite number of possible neighbors are sampled from the existing vertices with probability proportional to degree. Of these possibilities, the new vertex attaches to the vertex from the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1308.4067 شماره
صفحات -
تاریخ انتشار 2013